package Text1;

import java.util.*;
public class Main {

    public static void qsort(int[]arr,int l,int r){
        if(l>=r){
            return;
        }
        int x=arr[l+r>>1],i=l-1,j=r+1;
        while(i<j){
            do{
                i++;
            }while(arr[i]<x);
            do{
                j--;
            }while(arr[j]>x);
            if(i<j){
                swap(arr,i,j);
            }
        }
        qsort(arr,l,j);
        qsort(arr,j+1,r);

    }

    public static void swap(int[]arr,int i,int j){
        int t = arr[i];
        arr[i] = arr[j];
        arr[j] = t;
    }

    public static void msort(int[]arr,int l,int r){
        if(l>=r){
            return;
        }
        int mid=l+r>>1;
        msort(arr,l,mid);
        msort(arr,mid+1,r);
        int k=0,i=l,j=mid+1;
        int[] tmp=new int[r-l+1];
        while(i<=mid&&j<=r){
            if(arr[i]<arr[j]){
                tmp[k++]=arr[i++];
            }else{
                tmp[k++]=arr[j++];
            }
        }
        while(i<=mid){
            tmp[k++]=arr[i++];
        }
        while(j<=r){
            tmp[k++]=arr[j++];
        }

        for (int m = 0; m <tmp.length ; m++) {
            arr[m+l]=tmp[m];
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] q = new int[n];
        for(int i=0; i<n; i++){q[i] = sc.nextInt();}

        msort(q, 0, n-1);
        for(int i=0; i<n; i++){System.out.print(q[i] + " ");}
    }




}
